Triangular processor array for computing singular values
نویسندگان
چکیده
منابع مشابه
On computing accurate singular values and eigenvalues . . .
[15] D. O'Leary and G. W. Stewart. Computing the eigenvalues and eigenvectors of symmetric arrowhead matrices. [17] A. Sameh and D. Kuck. A parallel QR algorithm for symmetric tridiagonal matrices. [21] Zhonggang Zeng. The acyclic eigenproblem can be reduced to the arrowhead one. [22] Hongyuan Zha. A two-way chasing scheme for reducing a symmetric arrowhead matrix to tridiagonal form. Scientic ...
متن کاملAnalysis of a QR Algorithm for Computing Singular Values
We extend the Golub-Kahan algorithm for computing the singular value decomposition of bidiagonal matrices to triangular matrices R. Our algorithm avoids the explicit formation of R T R or RRT. We derive a relation between left and right singular vectors of triangular matrices and use it to prove monotonic convergence of singular values and singular vectors. The convergence rate for singular val...
متن کاملImplicit Cholesky algorithms for singular values and vectors of triangular matrices
The implicit Cholesky algorithm has been developed by several authors during the last 10 years but under different names. We identify the algorithm with a special version of Rutishauser's LR algorithm. Intermediate quantities in the transformation furnish several attractive approximations to the smallest singular value. The paper extols the advantages of using shifts with the algorithm. The non...
متن کاملEfficient Parallel Algorithm for Constructing a Unit Triangular Matrix with Prescribed Singular Values
The problem tackled in this paper is the parallel construction of a unit triangular matrix with prescribed singular values, when these fulfill Weyl’s conditions [9]; this is a particular case of the Inverse Singular Value Problem. A sequential algorithm for this problem was proposed in [10] by Kosowsky and Smoktunowicz. In this paper parallel versions of this algorithm will be described, both f...
متن کاملComputing the Singular Values of 2-by-2 Complex Matrices
The singular value decomposition (SVD) of a 2-by-2 complex matrix does not occur as frequently as that of a 2-by-2 real upper triangular matrix. The commonly used QR method for SVD consists of two stages. In the first stage, a matrix is reduced to bidiagonal form using, say, Householder transformations on both sides. In the second stage, the bidiagonal matrix resulted from the first stage is di...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Linear Algebra and its Applications
سال: 1986
ISSN: 0024-3795
DOI: 10.1016/0024-3795(86)90171-0